LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES
Identifieur interne : 004456 ( Main/Exploration ); précédent : 004455; suivant : 004457LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES
Auteurs : Jérome Besombes [France] ; Jean-Yves Marion [France]Source :
- Informatique théorique et applications : (Imprimé) [ 0988-3754 ] ; 2008.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Linguistique.
English descriptors
- KwdEn :
Abstract
We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000324
- to stream PascalFrancis, to step Curation: 000703
- to stream PascalFrancis, to step Checkpoint: 000276
- to stream Main, to step Merge: 004571
- to stream Main, to step Curation: 004456
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES</title><author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérome" last="Besombes">Jérome Besombes</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>ONERA/DTIM (Traitement de l'Information et Modélisation)</s1><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>ONERA/DTIM (Traitement de l'Information et Modélisation)</wicri:noRegion><wicri:noRegion>ONERA/DTIM (Traitement de l'Information et Modélisation)</wicri:noRegion></affiliation></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="4"><inist:fA14 i1="02"><s1>Nancy-Université, Loria-INPL-ENSMN</s1><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>Loria-INPL-ENSMN</wicri:noRegion><wicri:noRegion>Nancy-Université, Loria-INPL-ENSMN</wicri:noRegion><orgName type="university">Nancy-Université</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">08-0190439</idno><date when="2008">2008</date><idno type="stanalyst">PASCAL 08-0190439 INIST</idno><idno type="RBID">Pascal:08-0190439</idno><idno type="wicri:Area/PascalFrancis/Corpus">000324</idno><idno type="wicri:Area/PascalFrancis/Curation">000703</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000276</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000276</idno><idno type="wicri:doubleKey">0988-3754:2008:Besombes J:learning:discrete:categorial</idno><idno type="wicri:Area/Main/Merge">004571</idno><idno type="wicri:Area/Main/Curation">004456</idno><idno type="wicri:Area/Main/Exploration">004456</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES</title><author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérome" last="Besombes">Jérome Besombes</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>ONERA/DTIM (Traitement de l'Information et Modélisation)</s1><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>ONERA/DTIM (Traitement de l'Information et Modélisation)</wicri:noRegion><wicri:noRegion>ONERA/DTIM (Traitement de l'Information et Modélisation)</wicri:noRegion></affiliation></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="4"><inist:fA14 i1="02"><s1>Nancy-Université, Loria-INPL-ENSMN</s1><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>Loria-INPL-ENSMN</wicri:noRegion><wicri:noRegion>Nancy-Université, Loria-INPL-ENSMN</wicri:noRegion><orgName type="university">Nancy-Université</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName></affiliation></author></analytic><series><title level="j" type="main">Informatique théorique et applications : (Imprimé)</title><title level="j" type="abbreviated">Inform. théor. appl. : (Imprimé</title><idno type="ISSN">0988-3754</idno><imprint><date when="2008">2008</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Informatique théorique et applications : (Imprimé)</title><title level="j" type="abbreviated">Inform. théor. appl. : (Imprimé</title><idno type="ISSN">0988-3754</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Application</term><term>Computer theory</term><term>Grammar</term><term>Grammatical inference</term><term>Identification</term><term>Language class</term><term>Learning</term><term>Linguistics</term><term>Polynomial</term><term>Polynomial time</term><term>Word</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Apprentissage</term><term>Grammaire</term><term>Classe langage</term><term>Algorithme</term><term>Mot</term><term>Polynôme</term><term>Temps polynomial</term><term>Linguistique</term><term>Inférence grammaticale</term><term>Identification</term><term>Informatique théorique</term><term>Application</term><term>68T05</term><term>68Q42</term><term>68Wxx</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Linguistique</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement><orgName><li>Nancy-Université</li></orgName></list><tree><country name="France"><noRegion><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérome" last="Besombes">Jérome Besombes</name></noRegion><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004456 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004456 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:08-0190439
|texte= LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES
}}
| This area was generated with Dilib version V0.6.33. |  |